The symmetric all-furthest- neighbor problem
نویسندگان
چکیده
منابع مشابه
The Symmetric All-furthest- Neighbor Problem
Given a set 9 of n points on the plane, a symmerric_furfhesr-neighbor (SFN) pair of points p, q is one such that both p and q are furthest from each other among the points in 8. A pair of points is untipodal if it admits parallel lines of support. In this paper it is shown that a SFN pair of 9 is both a set of extreme points of 9 and an antipodul pair of 8. It is also shown that an asymmerricfu...
متن کاملApproximate Furthest Neighbor in High Dimensions
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclidean space. We build on the technique of Indyk (SODA 2003), storing random projections to provide sub...
متن کاملIncreasing Diversity Through Furthest Neighbor-Based Recommendation
One of the current challenges concerning improving recommender systems consists of finding ways of increasing serendipity and diversity, without compromising the precision and recall of the system. One possible way to approach this problem is to complement a standard recommender by another recommender “orthogonal” to the standard one, i.e. one that recommends different items than the standard. ...
متن کاملApproximate Furthest Neighbor with Application to Annulus Query
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclidean space. The method builds on the technique of Indyk (SODA 2003), storing random projections to pr...
متن کاملUnsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem
This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in R, the objective is to produce the hyperplane (passing through the origin) which maximizes the separation margin, that is, the minimal distance between the hyperplane and any input point. To the best of our knowledge, this is the first paper ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1983
ISSN: 0898-1221
DOI: 10.1016/0898-1221(83)90139-6